A Modified Fuzzy ART for Soft Document Clustering
نویسندگان
چکیده
Document clustering is a very useful application in recent days especially with the advent of the World Wide Web. Most of the existing document clustering algorithms either produce clusters of poor quality or are highly computationally expensive. In this paper we propose a document-clustering algorithm, KMART, that uses an unsupervised Fuzzy Adaptive Resonance Theory (Fuzzy-ART) neural network. A modified version of the Fuzzy ART is used to enable a document to be in multiple clusters. The number of clusters is determined dynamically. Some experiments are reported to compare the efficiency and execution time of our algorithm with other document-clustering algorithm like Fuzzy c Means. The results show that KMART is both effective and efficient.
منابع مشابه
Algorithms for Soft Document Clustering
Aim of this paper is to highlight the possibilities of clustering algorithms called as the "soft clustering" algorithms. The traditional approach "hard clustering" allows us to include only one document cluster. Soft clustering algorithms, like Fuzzy C-means (FCM), Word Base Soft Clustering (WBSC) Similarity-Based Soft Clustering Algorithm (SISC) and Kondadadi and Kozma modified ART (KMART), al...
متن کاملCombinación de clusterizadores difusos mediante voto posicional para clustering robusto de documentos
The combination of multiple clustering processes provides a means for building robust document clustering systems. This work focuses on the consolidation of fuzzy clusterings, proposing two consensus functions for soft cluster ensembles based on the Borda and Condorcet positional voting strategies. Experiments conducted on two document corpora reveal that the proposed soft consensus functions a...
متن کاملNew distance and similarity measures for hesitant fuzzy soft sets
The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...
متن کاملFuzzy Post-clustering Algorithm for Web Search Engine
We propose a new clustering algorithm satisfying requirements for the post-clustering algorithms as many as possible. The proposed “Fuzzy Concept ART” is the form of combining the concept vector having some advantages in document clustering with Fuzzy ART known as real-time clustering algorithms.
متن کاملA Survey of Fuzzy Clustering Algorithms for Pattern Recognition—Part II
In Part I of this paper [1], an equivalence between the concepts of fuzzy clustering and soft competitive learning in clustering algorithms is proposed on the basis of the existing literature. Moreover, a set of functional attributes is selected for use as dictionary entries in the comparison of clustering algorithms. In this paper, five clustering algorithms taken from the literature are revie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002